0.00/0.07	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.07/0.08	% Command    : run_E %s %d THM
0.07/0.28	% Computer : n018.cluster.edu
0.07/0.28	% Model    : x86_64 x86_64
0.07/0.28	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.07/0.28	% Memory   : 8042.1875MB
0.07/0.28	% OS       : Linux 3.10.0-693.el7.x86_64
0.07/0.28	% CPULimit   : 960
0.07/0.28	% WCLimit    : 120
0.07/0.28	% DateTime   : Tue Aug  9 06:23:15 EDT 2022
0.07/0.28	% CPUTime    : 
0.13/0.37	Running higher-order on 8 cores theorem proving
0.13/0.37	Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=120 /export/starexec/sandbox/benchmark/theBenchmark.p
0.13/0.37	# Version: 3.0pre003-ho
4.97/1.00	# Preprocessing class: HSMSSMSSSSSNSFA.
4.97/1.00	# Scheduled 4 strats onto 8 cores with 120 seconds (960 total)
4.97/1.00	# Starting new_ho_14 with 480s (4) cores
4.97/1.00	# Starting new_ho_13 with 240s (2) cores
4.97/1.00	# Starting new_ho_10_cnf2 with 120s (1) cores
4.97/1.00	# Starting new_bool_3 with 120s (1) cores
4.97/1.00	# new_bool_3 with pid 16471 completed with status 0
4.97/1.00	# Result found by new_bool_3
4.97/1.00	# Preprocessing class: HSMSSMSSSSSNSFA.
4.97/1.00	# Scheduled 4 strats onto 8 cores with 120 seconds (960 total)
4.97/1.00	# Starting new_ho_14 with 480s (4) cores
4.97/1.00	# Starting new_ho_13 with 240s (2) cores
4.97/1.00	# Starting new_ho_10_cnf2 with 120s (1) cores
4.97/1.00	# Starting new_bool_3 with 120s (1) cores
4.97/1.00	# SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
4.97/1.00	# ...ProofStateSinE()=11/45
4.97/1.00	# Search class: HGHSM-FFMF31-MSFFFFNN
4.97/1.00	# partial match(2): FGHSM-FFMF31-MFFFFFNN
4.97/1.00	# Scheduled 5 strats onto 1 cores with 120 seconds (120 total)
4.97/1.00	# Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with 73s (1) cores
4.97/1.00	# G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with pid 16472 completed with status 0
4.97/1.00	# Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN
4.97/1.00	# Preprocessing class: HSMSSMSSSSSNSFA.
4.97/1.00	# Scheduled 4 strats onto 8 cores with 120 seconds (960 total)
4.97/1.00	# Starting new_ho_14 with 480s (4) cores
4.97/1.00	# Starting new_ho_13 with 240s (2) cores
4.97/1.00	# Starting new_ho_10_cnf2 with 120s (1) cores
4.97/1.00	# Starting new_bool_3 with 120s (1) cores
4.97/1.00	# SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
4.97/1.00	# ...ProofStateSinE()=11/45
4.97/1.00	# Search class: HGHSM-FFMF31-MSFFFFNN
4.97/1.00	# partial match(2): FGHSM-FFMF31-MFFFFFNN
4.97/1.00	# Scheduled 5 strats onto 1 cores with 120 seconds (120 total)
4.97/1.00	# Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with 73s (1) cores
4.97/1.00	# Preprocessing time       : 0.001 s
4.97/1.00	# Presaturation interreduction done
4.97/1.00	
4.97/1.00	# Proof found!
4.97/1.00	# SZS status Theorem
4.97/1.00	# SZS output start CNFRefutation
4.97/1.00	thf(decl_22, type, bool: del).
4.97/1.00	thf(decl_23, type, ind: del).
4.97/1.00	thf(decl_24, type, arr: del > del > del).
4.97/1.00	thf(decl_25, type, mem: $i > del > $o).
4.97/1.00	thf(decl_26, type, ap: $i > $i > $i).
4.97/1.00	thf(decl_27, type, lam: del > ($i > $i) > $i).
4.97/1.00	thf(decl_28, type, p: $i > $o).
4.97/1.00	thf(decl_29, type, inj__o: $o > $i).
4.97/1.00	thf(decl_30, type, c_2Emin_2E_3D_3D_3E: $i).
4.97/1.00	thf(decl_31, type, c_2Epred__set_2ESUBSET: del > $i).
4.97/1.00	thf(decl_32, type, c_2Ebool_2E_7E: $i).
4.97/1.00	thf(decl_33, type, c_2Ebool_2E_2F_5C: $i).
4.97/1.00	thf(decl_34, type, c_2Ebool_2EIN: del > $i).
4.97/1.00	thf(decl_35, type, c_2Epred__set_2ECHOICE: del > $i).
4.97/1.00	thf(decl_36, type, c_2Epred__set_2EDELETE: del > $i).
4.97/1.00	thf(decl_37, type, c_2Epred__set_2EREST: del > $i).
4.97/1.00	thf(decl_38, type, c_2Emin_2E_3D: del > $i).
4.97/1.00	thf(decl_39, type, c_2Ebool_2E_21: del > $i).
4.97/1.00	thf(decl_40, type, esk1_0: del).
4.97/1.00	thf(decl_41, type, esk2_0: $i).
4.97/1.00	thf(decl_42, type, esk3_4: del > del > $i > $i > $i).
4.97/1.00	thf(decl_43, type, esk4_3: del > $i > $i > $i).
4.97/1.00	thf(ax_thm_2Epred__set_2ESUBSET__DEF, axiom, ![X11:del, X12:$i]:(((mem @ X12 @ (arr @ X11 @ bool))=>![X17:$i]:((((p @ (ap @ (ap @ (c_2Epred__set_2ESUBSET @ X11) @ X12) @ X17))<=>![X18:$i]:((((p @ (ap @ (ap @ (c_2Ebool_2EIN @ X11) @ X18) @ X17))<=(p @ (ap @ (ap @ (c_2Ebool_2EIN @ X11) @ X18) @ X12)))<=(mem @ X18 @ X11))))<=(mem @ X17 @ (arr @ X11 @ bool)))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', ax_thm_2Epred__set_2ESUBSET__DEF)).
4.97/1.00	thf(conj_thm_2Epred__set_2EREST__SUBSET, conjecture, ![X11:del, X12:$i]:(((mem @ X12 @ (arr @ X11 @ bool))=>(p @ (ap @ (ap @ (c_2Epred__set_2ESUBSET @ X11) @ (ap @ (c_2Epred__set_2EREST @ X11) @ X12)) @ X12)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', conj_thm_2Epred__set_2EREST__SUBSET)).
4.97/1.00	thf(ap_tp, axiom, ![X1:del, X4:del, X7:$i]:((![X3:$i]:(((mem @ (ap @ X7 @ X3) @ X4)<=(mem @ X3 @ X1)))<=(mem @ X7 @ (arr @ X1 @ X4)))), file('/export/starexec/sandbox/benchmark/Axioms/ITP001/ITP001^2.ax', ap_tp)).
4.97/1.00	thf(mem_c_2Epred__set_2EREST, axiom, ![X11:del]:((mem @ (c_2Epred__set_2EREST @ X11) @ (arr @ (arr @ X11 @ bool) @ (arr @ X11 @ bool)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', mem_c_2Epred__set_2EREST)).
4.97/1.00	thf(conj_thm_2Epred__set_2EIN__DELETE, axiom, ![X11:del, X12:$i]:(((mem @ X12 @ (arr @ X11 @ bool))=>![X13:$i]:(((mem @ X13 @ X11)=>![X14:$i]:((((p @ (ap @ (ap @ (c_2Ebool_2EIN @ X11) @ X13) @ (ap @ (ap @ (c_2Epred__set_2EDELETE @ X11) @ X12) @ X14)))<=>((p @ (ap @ (ap @ (c_2Ebool_2EIN @ X11) @ X13) @ X12))&((X13)!=(X14))))<=(mem @ X14 @ X11))))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', conj_thm_2Epred__set_2EIN__DELETE)).
4.97/1.00	thf(mem_c_2Epred__set_2ECHOICE, axiom, ![X11:del]:((mem @ (c_2Epred__set_2ECHOICE @ X11) @ (arr @ (arr @ X11 @ bool) @ X11))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', mem_c_2Epred__set_2ECHOICE)).
4.97/1.00	thf(ax_thm_2Epred__set_2EREST__DEF, axiom, ![X11:del, X12:$i]:(((mem @ X12 @ (arr @ X11 @ bool))=>((ap @ (c_2Epred__set_2EREST @ X11) @ X12)=(ap @ (ap @ (c_2Epred__set_2EDELETE @ X11) @ X12) @ (ap @ (c_2Epred__set_2ECHOICE @ X11) @ X12))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', ax_thm_2Epred__set_2EREST__DEF)).
4.97/1.00	thf(c_0_7, plain, ![X11:del, X12:$i]:(((mem @ X12 @ (arr @ X11 @ bool))=>![X17:$i]:(((mem @ X17 @ (arr @ X11 @ bool))=>((p @ (ap @ (ap @ (c_2Epred__set_2ESUBSET @ X11) @ X12) @ X17))<=>![X18:$i]:(((mem @ X18 @ X11)=>((p @ (ap @ (ap @ (c_2Ebool_2EIN @ X11) @ X18) @ X12))=>(p @ (ap @ (ap @ (c_2Ebool_2EIN @ X11) @ X18) @ X17)))))))))), inference(fof_simplification,[status(thm)],[ax_thm_2Epred__set_2ESUBSET__DEF])).
4.97/1.00	thf(c_0_8, negated_conjecture, ~(![X11:del, X12:$i]:(((mem @ X12 @ (arr @ X11 @ bool))=>(p @ (ap @ (ap @ (c_2Epred__set_2ESUBSET @ X11) @ (ap @ (c_2Epred__set_2EREST @ X11) @ X12)) @ X12))))), inference(assume_negation,[status(cth)],[conj_thm_2Epred__set_2EREST__SUBSET])).
4.97/1.00	thf(c_0_9, plain, ![X1:del, X4:del, X7:$i]:(((mem @ X7 @ (arr @ X1 @ X4))=>![X3:$i]:(((mem @ X3 @ X1)=>(mem @ (ap @ X7 @ X3) @ X4))))), inference(fof_simplification,[status(thm)],[ap_tp])).
4.97/1.00	thf(c_0_10, plain, ![X60:del, X61:$i, X62:$i, X63:$i]:(((~(p @ (ap @ (ap @ (c_2Epred__set_2ESUBSET @ X60) @ X61) @ X62))|(~(mem @ X63 @ X60)|(~(p @ (ap @ (ap @ (c_2Ebool_2EIN @ X60) @ X63) @ X61))|(p @ (ap @ (ap @ (c_2Ebool_2EIN @ X60) @ X63) @ X62))))|~(mem @ X62 @ (arr @ X60 @ bool))|~(mem @ X61 @ (arr @ X60 @ bool)))&(((mem @ (esk4_3 @ X60 @ X61 @ X62) @ X60)|(p @ (ap @ (ap @ (c_2Epred__set_2ESUBSET @ X60) @ X61) @ X62))|~(mem @ X62 @ (arr @ X60 @ bool))|~(mem @ X61 @ (arr @ X60 @ bool)))&(((p @ (ap @ (ap @ (c_2Ebool_2EIN @ X60) @ (esk4_3 @ X60 @ X61 @ X62)) @ X61))|(p @ (ap @ (ap @ (c_2Epred__set_2ESUBSET @ X60) @ X61) @ X62))|~(mem @ X62 @ (arr @ X60 @ bool))|~(mem @ X61 @ (arr @ X60 @ bool)))&(~(p @ (ap @ (ap @ (c_2Ebool_2EIN @ X60) @ (esk4_3 @ X60 @ X61 @ X62)) @ X62))|(p @ (ap @ (ap @ (c_2Epred__set_2ESUBSET @ X60) @ X61) @ X62))|~(mem @ X62 @ (arr @ X60 @ bool))|~(mem @ X61 @ (arr @ X60 @ bool))))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])])])).
4.97/1.00	thf(c_0_11, negated_conjecture, ((mem @ esk2_0 @ (arr @ esk1_0 @ bool))&~(p @ (ap @ (ap @ (c_2Epred__set_2ESUBSET @ esk1_0) @ (ap @ (c_2Epred__set_2EREST @ esk1_0) @ esk2_0)) @ esk2_0))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])).
4.97/1.00	thf(c_0_12, plain, ![X52:del, X53:del, X54:$i, X55:$i]:((~(mem @ X54 @ (arr @ X52 @ X53))|(~(mem @ X55 @ X52)|(mem @ (ap @ X54 @ X55) @ X53)))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])).
4.97/1.00	thf(c_0_13, plain, ![X58:del]:((mem @ (c_2Epred__set_2EREST @ X58) @ (arr @ (arr @ X58 @ bool) @ (arr @ X58 @ bool)))), inference(variable_rename,[status(thm)],[mem_c_2Epred__set_2EREST])).
4.97/1.00	thf(c_0_14, plain, ![X11:del, X12:$i]:(((mem @ X12 @ (arr @ X11 @ bool))=>![X13:$i]:(((mem @ X13 @ X11)=>![X14:$i]:(((mem @ X14 @ X11)=>((p @ (ap @ (ap @ (c_2Ebool_2EIN @ X11) @ X13) @ (ap @ (ap @ (c_2Epred__set_2EDELETE @ X11) @ X12) @ X14)))<=>((p @ (ap @ (ap @ (c_2Ebool_2EIN @ X11) @ X13) @ X12))&((X13)!=(X14)))))))))), inference(fof_simplification,[status(thm)],[conj_thm_2Epred__set_2EIN__DELETE])).
4.97/1.00	thf(c_0_15, plain, ![X65:del]:((mem @ (c_2Epred__set_2ECHOICE @ X65) @ (arr @ (arr @ X65 @ bool) @ X65))), inference(variable_rename,[status(thm)],[mem_c_2Epred__set_2ECHOICE])).
4.97/1.00	thf(c_0_16, plain, ![X3:$i, X5:$i, X1:del]:(((p @ (ap @ (ap @ (c_2Ebool_2EIN @ X1) @ (esk4_3 @ X1 @ X3 @ X5)) @ X3))|(p @ (ap @ (ap @ (c_2Epred__set_2ESUBSET @ X1) @ X3) @ X5))|~((mem @ X5 @ (arr @ X1 @ bool)))|~((mem @ X3 @ (arr @ X1 @ bool))))), inference(split_conjunct,[status(thm)],[c_0_10])).
4.97/1.00	thf(c_0_17, negated_conjecture, (mem @ esk2_0 @ (arr @ esk1_0 @ bool)), inference(split_conjunct,[status(thm)],[c_0_11])).
4.97/1.00	thf(c_0_18, plain, ![X3:$i, X5:$i, X4:del, X1:del]:(((mem @ (ap @ X3 @ X5) @ X4)|~((mem @ X3 @ (arr @ X1 @ X4)))|~((mem @ X5 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_12])).
4.97/1.00	thf(c_0_19, plain, ![X1:del]:((mem @ (c_2Epred__set_2EREST @ X1) @ (arr @ (arr @ X1 @ bool) @ (arr @ X1 @ bool)))), inference(split_conjunct,[status(thm)],[c_0_13])).
4.97/1.00	thf(c_0_20, plain, ![X3:$i, X5:$i, X1:del]:(((mem @ (esk4_3 @ X1 @ X3 @ X5) @ X1)|(p @ (ap @ (ap @ (c_2Epred__set_2ESUBSET @ X1) @ X3) @ X5))|~((mem @ X5 @ (arr @ X1 @ bool)))|~((mem @ X3 @ (arr @ X1 @ bool))))), inference(split_conjunct,[status(thm)],[c_0_10])).
4.97/1.00	thf(c_0_21, plain, ![X66:del, X67:$i, X68:$i, X69:$i]:(((((p @ (ap @ (ap @ (c_2Ebool_2EIN @ X66) @ X68) @ X67))|~(p @ (ap @ (ap @ (c_2Ebool_2EIN @ X66) @ X68) @ (ap @ (ap @ (c_2Epred__set_2EDELETE @ X66) @ X67) @ X69)))|~(mem @ X69 @ X66)|~(mem @ X68 @ X66)|~(mem @ X67 @ (arr @ X66 @ bool)))&(((X68)!=(X69))|~(p @ (ap @ (ap @ (c_2Ebool_2EIN @ X66) @ X68) @ (ap @ (ap @ (c_2Epred__set_2EDELETE @ X66) @ X67) @ X69)))|~(mem @ X69 @ X66)|~(mem @ X68 @ X66)|~(mem @ X67 @ (arr @ X66 @ bool))))&(~(p @ (ap @ (ap @ (c_2Ebool_2EIN @ X66) @ X68) @ X67))|((X68)=(X69))|(p @ (ap @ (ap @ (c_2Ebool_2EIN @ X66) @ X68) @ (ap @ (ap @ (c_2Epred__set_2EDELETE @ X66) @ X67) @ X69)))|~(mem @ X69 @ X66)|~(mem @ X68 @ X66)|~(mem @ X67 @ (arr @ X66 @ bool))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])])])).
4.97/1.00	thf(c_0_22, plain, ![X56:del, X57:$i]:((~(mem @ X57 @ (arr @ X56 @ bool))|((ap @ (c_2Epred__set_2EREST @ X56) @ X57)=(ap @ (ap @ (c_2Epred__set_2EDELETE @ X56) @ X57) @ (ap @ (c_2Epred__set_2ECHOICE @ X56) @ X57))))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax_thm_2Epred__set_2EREST__DEF])])).
4.97/1.00	thf(c_0_23, plain, ![X1:del]:((mem @ (c_2Epred__set_2ECHOICE @ X1) @ (arr @ (arr @ X1 @ bool) @ X1))), inference(split_conjunct,[status(thm)],[c_0_15])).
4.97/1.00	thf(c_0_24, negated_conjecture, ![X3:$i]:(((p @ (ap @ (ap @ (c_2Ebool_2EIN @ esk1_0) @ (esk4_3 @ esk1_0 @ X3 @ esk2_0)) @ X3))|(p @ (ap @ (ap @ (c_2Epred__set_2ESUBSET @ esk1_0) @ X3) @ esk2_0))|~((mem @ X3 @ (arr @ esk1_0 @ bool))))), inference(spm,[status(thm)],[c_0_16, c_0_17])).
4.97/1.00	thf(c_0_25, plain, ![X3:$i, X1:del]:(((mem @ (ap @ (c_2Epred__set_2EREST @ X1) @ X3) @ (arr @ X1 @ bool))|~((mem @ X3 @ (arr @ X1 @ bool))))), inference(spm,[status(thm)],[c_0_18, c_0_19])).
4.97/1.00	thf(c_0_26, negated_conjecture, ![X3:$i]:(((p @ (ap @ (ap @ (c_2Epred__set_2ESUBSET @ esk1_0) @ X3) @ esk2_0))|(mem @ (esk4_3 @ esk1_0 @ X3 @ esk2_0) @ esk1_0)|~((mem @ X3 @ (arr @ esk1_0 @ bool))))), inference(spm,[status(thm)],[c_0_20, c_0_17])).
4.97/1.00	thf(c_0_27, plain, ![X3:$i, X6:$i, X5:$i, X1:del]:(((p @ (ap @ (ap @ (c_2Ebool_2EIN @ X1) @ X3) @ X5))|~((p @ (ap @ (ap @ (c_2Ebool_2EIN @ X1) @ X3) @ (ap @ (ap @ (c_2Epred__set_2EDELETE @ X1) @ X5) @ X6))))|~((mem @ X6 @ X1))|~((mem @ X3 @ X1))|~((mem @ X5 @ (arr @ X1 @ bool))))), inference(split_conjunct,[status(thm)],[c_0_21])).
4.97/1.00	thf(c_0_28, plain, ![X3:$i, X1:del]:((((ap @ (c_2Epred__set_2EREST @ X1) @ X3)=(ap @ (ap @ (c_2Epred__set_2EDELETE @ X1) @ X3) @ (ap @ (c_2Epred__set_2ECHOICE @ X1) @ X3)))|~((mem @ X3 @ (arr @ X1 @ bool))))), inference(split_conjunct,[status(thm)],[c_0_22])).
4.97/1.00	thf(c_0_29, plain, ![X3:$i, X1:del]:(((mem @ (ap @ (c_2Epred__set_2ECHOICE @ X1) @ X3) @ X1)|~((mem @ X3 @ (arr @ X1 @ bool))))), inference(spm,[status(thm)],[c_0_18, c_0_23])).
4.97/1.00	thf(c_0_30, negated_conjecture, ![X3:$i]:(((p @ (ap @ (ap @ (c_2Ebool_2EIN @ esk1_0) @ (esk4_3 @ esk1_0 @ (ap @ (c_2Epred__set_2EREST @ esk1_0) @ X3) @ esk2_0)) @ (ap @ (c_2Epred__set_2EREST @ esk1_0) @ X3)))|(p @ (ap @ (ap @ (c_2Epred__set_2ESUBSET @ esk1_0) @ (ap @ (c_2Epred__set_2EREST @ esk1_0) @ X3)) @ esk2_0))|~((mem @ X3 @ (arr @ esk1_0 @ bool))))), inference(spm,[status(thm)],[c_0_24, c_0_25])).
4.97/1.00	thf(c_0_31, negated_conjecture, ~((p @ (ap @ (ap @ (c_2Epred__set_2ESUBSET @ esk1_0) @ (ap @ (c_2Epred__set_2EREST @ esk1_0) @ esk2_0)) @ esk2_0))), inference(split_conjunct,[status(thm)],[c_0_11])).
4.97/1.00	thf(c_0_32, negated_conjecture, ![X3:$i]:(((p @ (ap @ (ap @ (c_2Epred__set_2ESUBSET @ esk1_0) @ (ap @ (c_2Epred__set_2EREST @ esk1_0) @ X3)) @ esk2_0))|(mem @ (esk4_3 @ esk1_0 @ (ap @ (c_2Epred__set_2EREST @ esk1_0) @ X3) @ esk2_0) @ esk1_0)|~((mem @ X3 @ (arr @ esk1_0 @ bool))))), inference(spm,[status(thm)],[c_0_26, c_0_25])).
4.97/1.00	thf(c_0_33, plain, ![X3:$i, X5:$i, X1:del]:(((p @ (ap @ (ap @ (c_2Ebool_2EIN @ X1) @ X3) @ X5))|~((p @ (ap @ (ap @ (c_2Ebool_2EIN @ X1) @ X3) @ (ap @ (c_2Epred__set_2EREST @ X1) @ X5))))|~((mem @ X5 @ (arr @ X1 @ bool)))|~((mem @ X3 @ X1)))), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_27, c_0_28]), c_0_29])).
4.97/1.00	thf(c_0_34, negated_conjecture, (p @ (ap @ (ap @ (c_2Ebool_2EIN @ esk1_0) @ (esk4_3 @ esk1_0 @ (ap @ (c_2Epred__set_2EREST @ esk1_0) @ esk2_0) @ esk2_0)) @ (ap @ (c_2Epred__set_2EREST @ esk1_0) @ esk2_0))), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30, c_0_17]), c_0_31])).
4.97/1.00	thf(c_0_35, negated_conjecture, (mem @ (esk4_3 @ esk1_0 @ (ap @ (c_2Epred__set_2EREST @ esk1_0) @ esk2_0) @ esk2_0) @ esk1_0), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_32, c_0_17]), c_0_31])).
4.97/1.00	thf(c_0_36, plain, ![X3:$i, X5:$i, X1:del]:(((p @ (ap @ (ap @ (c_2Epred__set_2ESUBSET @ X1) @ X3) @ X5))|~((p @ (ap @ (ap @ (c_2Ebool_2EIN @ X1) @ (esk4_3 @ X1 @ X3 @ X5)) @ X5)))|~((mem @ X5 @ (arr @ X1 @ bool)))|~((mem @ X3 @ (arr @ X1 @ bool))))), inference(split_conjunct,[status(thm)],[c_0_10])).
4.97/1.00	thf(c_0_37, negated_conjecture, (p @ (ap @ (ap @ (c_2Ebool_2EIN @ esk1_0) @ (esk4_3 @ esk1_0 @ (ap @ (c_2Epred__set_2EREST @ esk1_0) @ esk2_0) @ esk2_0)) @ esk2_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33, c_0_34]), c_0_17]), c_0_35])])).
4.97/1.00	thf(c_0_38, negated_conjecture, ~((mem @ (ap @ (c_2Epred__set_2EREST @ esk1_0) @ esk2_0) @ (arr @ esk1_0 @ bool))), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36, c_0_37]), c_0_17])]), c_0_31])).
4.97/1.00	thf(c_0_39, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38, c_0_25]), c_0_17])]), ['proof']).
4.97/1.00	# SZS output end CNFRefutation
4.97/1.00	# Parsed axioms                        : 45
4.97/1.00	# Removed by relevancy pruning/SinE    : 34
4.97/1.00	# Initial clauses                      : 18
4.97/1.00	# Removed in clause preprocessing      : 0
4.97/1.00	# Initial clauses in saturation        : 18
4.97/1.00	# Processed clauses                    : 395
4.97/1.00	# ...of these trivial                  : 0
4.97/1.00	# ...subsumed                          : 28
4.97/1.00	# ...remaining for further processing  : 367
4.97/1.00	# Other redundant clauses eliminated   : 1
4.97/1.00	# Clauses deleted for lack of memory   : 0
4.97/1.00	# Backward-subsumed                    : 20
4.97/1.00	# Backward-rewritten                   : 4
4.97/1.00	# Generated clauses                    : 2964
4.97/1.00	# ...of the previous two non-redundant : 2953
4.97/1.00	# ...aggressively subsumed             : 0
4.97/1.00	# Contextual simplify-reflections      : 12
4.97/1.00	# Paramodulations                      : 2962
4.97/1.00	# Factorizations                       : 0
4.97/1.00	# NegExts                              : 0
4.97/1.00	# Equation resolutions                 : 2
4.97/1.00	# Propositional unsat checks           : 0
4.97/1.00	#    Propositional check models        : 0
4.97/1.00	#    Propositional check unsatisfiable : 0
4.97/1.00	#    Propositional clauses             : 0
4.97/1.00	#    Propositional clauses after purity: 0
4.97/1.00	#    Propositional unsat core size     : 0
4.97/1.00	#    Propositional preprocessing time  : 0.000
4.97/1.00	#    Propositional encoding time       : 0.000
4.97/1.00	#    Propositional solver time         : 0.000
4.97/1.00	#    Success case prop preproc time    : 0.000
4.97/1.00	#    Success case prop encoding time   : 0.000
4.97/1.00	#    Success case prop solver time     : 0.000
4.97/1.00	# Current number of processed clauses  : 324
4.97/1.00	#    Positive orientable unit clauses  : 11
4.97/1.00	#    Positive unorientable unit clauses: 0
4.97/1.00	#    Negative unit clauses             : 2
4.97/1.00	#    Non-unit-clauses                  : 311
4.97/1.00	# Current number of unprocessed clauses: 2590
4.97/1.00	# ...number of literals in the above   : 15900
4.97/1.00	# Current number of archived formulas  : 0
4.97/1.00	# Current number of archived clauses   : 42
4.97/1.00	# Clause-clause subsumption calls (NU) : 21972
4.97/1.00	# Rec. Clause-clause subsumption calls : 4314
4.97/1.00	# Non-unit clause-clause subsumptions  : 53
4.97/1.00	# Unit Clause-clause subsumption calls : 108
4.97/1.00	# Rewrite failures with RHS unbound    : 0
4.97/1.00	# BW rewrite match attempts            : 83
4.97/1.00	# BW rewrite match successes           : 2
4.97/1.00	# Condensation attempts                : 0
4.97/1.00	# Condensation successes               : 0
4.97/1.00	# Termbank termtop insertions          : 265490
4.97/1.00	
4.97/1.00	# -------------------------------------------------
4.97/1.00	# User time                : 0.613 s
4.97/1.00	# System time              : 0.010 s
4.97/1.00	# Total time               : 0.623 s
4.97/1.00	# Maximum resident set size: 1972 pages
4.97/1.00	
4.97/1.00	# -------------------------------------------------
4.97/1.00	# User time                : 0.615 s
4.97/1.00	# System time              : 0.012 s
4.97/1.00	# Total time               : 0.626 s
4.97/1.00	# Maximum resident set size: 1788 pages
4.97/1.01	EOF